Three-graphs without two triples whose symmetric difference is contained in a third
نویسندگان
چکیده
منابع مشابه
Ela Graphs Whose Minimal Rank Is Two
Let F be a field, G = (V, E) be an undirected graph on n vertices, and let S(F, G) be the set of all symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For example, if G is a path, S(F, G) consists of the symmetric irreducible tridiagonal matrices. Let mr(F, G) be the minimum rank over all matrices in S(F, G). Then mr(F, G...
متن کاملGraphs whose minimal rank is two
Let F be a field, G = (V, E) be an undirected graph on n vertices, and let S(F,G) be the set of all symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For example, if G is a path, S(F,G) consists of the symmetric irreducible tridiagonal matrices. Let mr(F,G) be the minimum rank over all matrices in S(F,G). Then mr(F,G) = 1...
متن کاملGraphs whose minimal rank is two: The finite fields case
Let F be a finite field, G = (V, E) be an undirected graph on n vertices, and let S(F,G) be the set of all symmetric n× n matrices over F whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let mr(F,G) be the minimum rank of all matrices in S(F,G). If F is a finite field with pt elements, p = 2, it is shown that mr(F,G) ≤ 2 if and only if the compl...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملSets Whose Difference Set Is Square-free
The purpose of this note is to give an exposition of the best-known bound on the density of sets whose difference set contains no squares which was first derived by Pintz, Steiger and Szemerédi in [PSS88]. We show how their method can be brought in line with the modern view of the energy increment strategy employed in problems such as Szemerédi’s Theorem on arithmetic progressions, and explore ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1974
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90105-8